1![DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978 DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978](https://www.pdfsearch.io/img/39666b36d9109e589e87793d2f1cd6be.jpg) | Add to Reading ListSource URL: personal.stevens.eduLanguage: English - Date: 2011-06-27 08:31:04
|
---|
2![Crystals That Nature Might Miss Creating Toshikazu Sunada N Crystals That Nature Might Miss Creating Toshikazu Sunada N](https://www.pdfsearch.io/img/9885e80906d8219dd9984583c6663ad8.jpg) | Add to Reading ListSource URL: www.ams.orgLanguage: English - Date: 2008-06-05 09:39:55
|
---|
3![Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali](https://www.pdfsearch.io/img/c9b990beadd5cc602826fcb29939c3f2.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2013-01-07 10:28:15
|
---|
4![MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat](https://www.pdfsearch.io/img/6ded7648f63d68b88217c1ade6449a9c.jpg) | Add to Reading ListSource URL: www.cs.tau.ac.ilLanguage: English - Date: 2009-01-01 08:42:50
|
---|
5![EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings. This EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings. This](https://www.pdfsearch.io/img/b3490851d5cf63d38630c411395796a6.jpg) | Add to Reading ListSource URL: iti.mff.cuni.czLanguage: English - Date: 2016-02-04 05:53:38
|
---|
6![High Girth Cubic Graphs Map to the Clebsch Graph Matt DeVos ˇamal Robert S´ High Girth Cubic Graphs Map to the Clebsch Graph Matt DeVos ˇamal Robert S´](https://www.pdfsearch.io/img/294569dcfcfea57f726a5578f0457ffe.jpg) | Add to Reading ListSource URL: iti.mff.cuni.czLanguage: English - Date: 2016-02-04 05:53:37
|
---|
7![Polynomials / Equations / Cubic function / Function / Differential equation / Graph of a function / Mathematics / Elementary algebra / Functions and mappings Polynomials / Equations / Cubic function / Function / Differential equation / Graph of a function / Mathematics / Elementary algebra / Functions and mappings](/pdf-icon.png) | Add to Reading ListSource URL: home.scarlet.beLanguage: English - Date: 2001-07-10 08:37:39
|
---|
8![Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava, Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava,](https://www.pdfsearch.io/img/07b92c461f577938abad82e67214bf54.jpg) | Add to Reading ListSource URL: www.fi.muni.czLanguage: English - Date: 2005-02-11 15:57:54
|
---|
9![Curriculum Vitae Personal Dates Name: Ken-ichi Kawarabayashi Curriculum Vitae Personal Dates Name: Ken-ichi Kawarabayashi](https://www.pdfsearch.io/img/e9250871acae1e1330edc043df6affe9.jpg) | Add to Reading ListSource URL: research.nii.ac.jpLanguage: English - Date: 2012-10-11 03:26:00
|
---|
10![Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David](https://www.pdfsearch.io/img/145b5e3fe8d8e7040e1d42e248692629.jpg) | Add to Reading ListSource URL: www.fi.muni.czLanguage: English - Date: 2013-12-16 02:39:42
|
---|